Complete graph - PDFSEARCH.IO - Document Search Engine

Complete graph
Results: 868

#	Item
241	CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic Add to Reading List Source URL: stanford.edu Language: English - Date: 2015-03-23 01:42:05 NP-complete problems Clique Travelling salesman problem Vertex cover NP-complete Cut Path decomposition Feedback vertex set Graph theory Theoretical computer science Mathematics
242	arXiv:0909.2005v1 [cs.DS] 10 SepDeterministic approximation for the cover time of trees Uriel Feige∗ Add to Reading List Source URL: arxiv.org Language: English - Date: 2009-09-10 14:01:15 Analysis of algorithms SL Randomized algorithm Connectivity NP-complete problems Graph coloring Theoretical computer science Computational complexity theory Applied mathematics
243	Directing Complete Graphs and Avoiding Certain Structures January 31, 2015 The avoiding problem is defined as follows: the inputs consists of a simple Add to Reading List Source URL: payam-research.atwebpages.com Language: English - Date: 2015-01-31 03:24:13 NP-complete problems Morphisms Longest path problem Network theory Graph homomorphism Graph theory Theoretical computer science Mathematics
244	Dynamic Graphs in the Sliding-Window Model? Michael S. Crouch, Andrew McGregor, and Daniel Stubbs University of Massachusetts Amherst 140 Governors Drive, Amherst, MA 01003 {mcc,mcgregor,dstubbs}@cs.umass.edu Add to Reading List Source URL: people.cs.umass.edu Language: English - Date: 2013-06-23 17:01:11 Spanning tree Combinatorial optimization Matching Minimum spanning tree Graph NP-complete problems Graph theory Theoretical computer science Mathematics
245	Correlation Clustering and Two-edge-connected Augmentation for Planar Graphs Philip N. Klein1 , Claire Mathieu2,3 , and Hang Zhou3 1 Brown University, United States Add to Reading List Source URL: www.normalesup.org Language: English - Date: 2015-03-16 13:08:36 NP-complete problems Cluster analysis Correlation clustering Graph Minor Planar graph Dominating set Independent set Matroid theory Graph theory Mathematics Theoretical computer science
246	Local Distributed Decision∗ Pierre Fraigniaud† Amos Korman† David Peleg‡ Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2011-10-30 17:16:12 NP-complete problems Network flow Operations research Probabilistic complexity theory Randomized algorithm Modular decomposition Dominating set Flow network XTR Theoretical computer science Mathematics Graph theory
247	Polylogarithmic Network Navigability Using Compact Metrics with Small Stretch Pierre Fraigniaud∗ Cyril Gavoille† Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2008-04-15 13:07:10 Graph operations Tree decomposition Connectivity NP-complete problems Network flow Graph theory Theoretical computer science Mathematics
248	Towards a Complexity Theory for Local Distributed Computing⇤ Pierre Fraigniaud† Amos Korman† Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2013-08-21 13:35:48 NP-complete problems Graph coloring Graph theory Analysis of algorithms Complexity classes Randomized algorithm Distributed computing Minimum spanning tree SL Theoretical computer science Computational complexity theory Mathematics
249	On Hardness of Pricing Items for Single-Minded Bidders∗ Rohit Khandekar Tracy Kimbrel Konstantin Makarychev Add to Reading List Source URL: konstantin.makarychev.net Language: English - Date: 2014-06-08 22:16:35 NP-complete problems Combinatorial optimization Graph connectivity Matching Maximum cut Directed acyclic graph Cut Bipartite graph Graph Graph theory Theoretical computer science Mathematics
250	On the Impact of Identifiers on Local Decision? Pierre Fraigniaud1?? , Magn´ us M. Halld´orsson2? ? ? , and Amos Korman∗∗ 1 2 Add to Reading List Source URL: www.liafa.jussieu.fr Language: English - Date: 2012-10-01 06:03:38 NP-complete problems Network flow Graph coloring Randomized algorithm Connectivity Flow network Distributed computing Modular decomposition Belief propagation Graph theory Theoretical computer science Mathematics

UPDATE